Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:
Traduction et analyse de mots par intelligence artificielle ChatGPT
Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:
- comment le mot est utilisé
- fréquence d'utilisation
- il est utilisé plus souvent dans le discours oral ou écrit
- options de traduction de mots
- exemples d'utilisation (plusieurs phrases avec traduction)
- étymologie
Qu'est-ce (qui) est numeralwise representable - définition
FUNCTOR F: C → SET TO THE CATEGORY OF SETS, NATURALLY ISOMORPHIC TO A HOM-FUNCTOR HOM(X, –) FOR SOME OBJECT X IN C
Universal element; Representable presheaf; Representing object
Representable functor
In mathematics, particularly category theory, a representable functor is a certain functor from an arbitrary category into the category of sets. Such functors give representations of an abstract category in terms of known structures (i.
Matroid representation
![The [[Perles configuration]], linear over the reals but not the rationals](https://commons.wikimedia.org/wiki/Special:FilePath/Perles configuration.svg?width=200 "The [[Perles configuration]], linear over the reals but not the rationals")
![The [[Vámos matroid]], not linear over any field](https://commons.wikimedia.org/wiki/Special:FilePath/Vamos matroid.svg?width=200 "The [[Vámos matroid]], not linear over any field")
ABSTRACT COMBINATORIAL REPRESENTATION OF LINEARLY INDEPENDENT VECTORS
Linear matroid; Representable matroid
In the mathematical theory of matroids, a matroid representation is a family of vectors whose linear independence relation is the same as that of a given matroid. Matroid representations are analogous to group representations; both types of representation provide abstract algebraic structures (matroids and groups respectively) with concrete descriptions in terms of linear algebra.
Succinct game
IN ALGORITHMIC GAME THEORY
Succinctly representable game; Polymatrix game
In algorithmic game theory, a succinct game or a succinctly representable game is a game which may be represented in a size much smaller than its normal form representation. Without placing constraints on player utilities, describing a game of n players, each facing s strategies, requires listing ns^n utility values.
Wikipédia
Representable functor
In mathematics, particularly category theory, a representable functor is a certain functor from an arbitrary category into the category of sets. Such functors give representations of an abstract category in terms of known structures (i.e. sets and functions) allowing one to utilize, as much as possible, knowledge about the category of sets in other settings.
From another point of view, representable functors for a category C are the functors given with C. Their theory is a vast generalisation of upper sets in posets, and of Cayley's theorem in group theory.
